Least <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e158" altimg="si5.svg"><mml:mi>Q</mml:mi></mml:math>-eigenvalues of nonbipartite 2-connected graphs
نویسندگان
چکیده
Among all simple nonbipartite 2-connected graphs, the minimum least Q-eigenvalues are completely determined. As for θ-graphs known as a special class of also
منابع مشابه
On the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملOrdering Unicyclic Graphs in Terms of Their Smaller Least Eigenvalues
Let G be a simple graph with n vertices, and let A be the 0, 1 -adjacency matrix of G. We call det λI −A the characteristic polynomial of G, denoted by P G; λ , or abbreviated P G . Since A is symmetric, its eigenvalues λ1 G , λ2 G , . . . , λn G are real, and we assume that λ1 G ≥ λ2 G ≥ · · · ≥ λn G . We call λn G the least eigenvalue of G. Up to now, some good results on the least eigenvalue...
متن کاملOn the least signless Laplacian eigenvalues of some graphs
For a graph, the least signless Laplacian eigenvalue is the least eigenvalue of its signless Laplacian matrix. This paper investigates how the least signless Laplacian eigenvalue of a graph changes under some perturbations, and minimizes the least signless Laplacian eigenvalue among all the nonbipartite graphs with given matching number and edge cover number, respectively.
متن کاملGenerating connected and 2-edge connected graphs
We focus on the algorithm underlying the main result of [6]. This is an algebraic formula to generate all connected graphs in a recursive and efficient manner. The key feature is that each graph carries a scalar factor given by the inverse of the order of its group of automorphisms. In the present paper, we revise that algorithm on the level of graphs. Moreover, we extend the result subsequentl...
متن کاملOn the eigenvalues of non-commuting graphs
The non-commuting graph $Gamma(G)$ of a non-abelian group $G$ with the center $Z(G)$ is a graph with thevertex set $V(Gamma(G))=Gsetminus Z(G)$ and two distinct vertices $x$ and $y$ are adjacent in $Gamma(G)$if and only if $xy neq yx$. The aim of this paper is to compute the spectra of some well-known NC-graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2021.02.032